import math


class Solution:
    def eliminateMaximum(self, dist: list, speed: list) -> int:
        round = []
        for i in range(len(dist)):
            round.append(math.ceil(dist[i] / speed[i]))
        round.sort()
        res = 0
        for i in range(len(round)):
            if i >= round[i]:
                break
            res += 1
        return res
